


public class oldCode {

	
	/***
	 * Tests many(n) NN and returns the best path it finds
	 * @return
	 */
	/*
	public static String testManyNN(){
		node[] orgnodes = nodes;
		
		double bestTotaldist = 1000000000;
		node[] bestsolution = nodes.clone();
		double totaldist =0;
		
		String path = "", bestPath = "";
		
		for(int i = 0;i<n;i++){
			if(System.currentTimeMillis() > solutionDue){
				break;
			}
			nodes = orgnodes;
			String[] info = nearestNeighbor(false).split(" ");
			totaldist = Double.parseDouble((info[0]));
			path = info[1];
			
			if(print)System.out.println("Created a solution with: " + totaldist);
			
			if(totaldist < bestTotaldist){
				bestPath = path;
				bestTotaldist = totaldist;
				bestsolution = nodes.clone();
			}
		}
		if(print)System.out.print("The best found solution have a dist of: " + bestTotaldist);
		nodes = bestsolution;
		return bestPath;
	}
*/
}
